Factorisation of Littlewood–Richardson coefficients
نویسندگان
چکیده
منابع مشابه
The Hive Model and the Factorisation of Kostka Coefficients
The hive model is used to explore the properties of both Kostka coefficients and stretched Kostka coefficient polynomials. It is shown that both of these may factorise, and that they can then be expressed as products of certain primitive coefficients and polynomials, respectively. It is further shown how to determine a sequence of linear factors (t+m) of the primitive polynomials, where t is th...
متن کاملAcoustic Factorisation
This paper describes a new technique for training a speech recognition system on inhomogenous training data. The proposed technique , acoustic factorisation, attempts to explicitly model all the factors that affect the acoustic signal. By explicitly modelling all the factors the trained model set may be used in a more flexible fashion than in standard adaptive training schemes. Since an individ...
متن کاملFactorisation of Macdonald polynomials
1. Macdonald polynomials Macdonald polynomials P λ (x; q, t) are orthogonal symmetric polynomials which are the natural multivariable generalisation of the continuous q-ultraspherical polyno-mials C n (x; β|q) [2] which, in their turn, constitute an important class of hyper-geometric orthogonal polynomials in one variable. Polynomials C n (x; β|q) can be obtained from the general Askey-Wilson p...
متن کاملLZ77 Factorisation of Trees
We generalise the fundamental concept of LZ77 factorisation from strings to trees. A tree is represented as a collection of edge-disjoint fragments that either consist of one node or has already occurred earlier (in the BFS order). Similarly as for strings, such a collection uniquely determines the tree, so by minimising the number of fragments we obtain a compressed representation of the tree....
متن کاملFactorisation of Snarks
We develop a theory of factorisation of snarks — cubic graphs with edge-chromatic number 4 — based on the classical concept of the dot product. Our main concern are irreducible snarks, those where the removal of every nontrivial edge-cut yields a 3-edge-colourable graph. We show that if an irreducible snark can be expressed as a dot product of two smaller snarks, then both of them are irreducib...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2009
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2008.06.005